By using SIAM Journals Online you agree to abide by the
Terms and Conditions of Use.

©  SIAM

 

SIAM Journal on Computing

Table of Contents
Search This Issue
Volume 2, Issue 1, pp. 1-66

Please Note: Electronic articles are available well in advance of the printed articles.

What Article options are available ?   View Cart   

The Enumeration of Maximal Cliques of Large Graphs

E. A. Akkoyunlu

pp. 1-6

BibTeX  Abstract Full Text:  PDF

The Specialization of Programs by Theorem Proving

C. L. Chang, R. C. T. Lee, and J. K. Dixon

pp. 7-15

BibTeX  Abstract Full Text:  PDF

Eulerian Walks in Graphs

S. Goodman and S. Hedetniemi

pp. 16-27

BibTeX  Abstract Full Text:  PDF

A New Algorithm for Finding All Shortest Paths in a Graph of Positive Arcs in Average Time $O(n^2 \log ^2 n)$

P. M. Spira

pp. 28-32

BibTeX  Abstract Full Text:  PDF

Binary Search Trees of Bounded Balance

J. Nievergelt and E. M. Reingold

pp. 33-43

BibTeX  Abstract Full Text:  PDF

Isomorph Rejection and a Theorem of De Bruijn

S. G. Williamson

pp. 44-59

BibTeX  Abstract Full Text:  PDF

On the Number of Nonscalar Multiplications Necessary to Evaluate Polynomials

Michael S. Paterson and Larry J. Stockmeyer

pp. 60-66

BibTeX  Abstract Full Text:  PDF